Cryptanalysis of Liaw's broadcasting Cryptosystem
نویسندگان
چکیده
منابع مشابه
Cryptanalysis of Improved Liaw's Broadcasting Cryptosystem
A secure broadcasting cryptosystem must provide a secure communication channel from a sender to a group of legal or authorized receivers. Many of the proposed systems [3-5] require a large number of broadcast messages and present a number of problems. Moreover, Liaw [2] proposed a secure broadcasting scheme with fewer broadcasting messages, which allows easy insertion of new users into the acti...
متن کاملCryptanalysis of Another Knapsack Cryptosystem
At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see [11]). We show that this system is not secure, and we describe two different ways of breaking it using the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerful algorithm (see [1, 13, 14]). For more details, the reader should refer to [4]. 1 The proposed cryptosy...
متن کاملCryptanalysis of the Sidelnikov Cryptosystem
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effective if the parameters of the Reed-Muller code allow for efficient sampling of minimum weight codewords. For example, the length 2048, 3rd-order Reed-Muller code as proposed in [8] takes roughly an hour to break on a sto...
متن کاملCryptanalysis of the TTM Cryptosystem
In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building triangular systems we call T has been initiated by Shamir. In the present paper, we study a more general family of TPM (for ”Triangle Plus Minus”) schemes: a triangular construction mixed with some u random polynomials and with...
متن کاملCryptanalysis of the CFVZ cryptosystem
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system is dominated by the complexity of solving a fixed number of discrete logarithm problems in the group of an elliptic curve. Using an adapted Pollard rh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2001
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(01)00122-5